Subdivision for Line Drawings
نویسنده
چکیده
This paper presents approaches of incorporating subdivision techniques in the rendering process for computer-generated line drawings. A new method for accelerating silhouette detection is introduced. This “silhouette propagation” method gains its strength from being intertwined with the 3D subdivision process. Another technique reduces the number of 3D subdivision steps necessary for high-quality renditions of line drawings. It is shown how, by using 2D subdivision on curves, the same line quality can be achieved that the computationally much more expensive 3D subdivision yields.
منابع مشابه
Subdivision Drawings of Hypergraphs
We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each hyperedge, the union of the faces corresponding to the vertices incident to that hyperedge is connected. Vertex-based Venn diagrams and concrete Euler diagrams are both subdivision drawings. In this paper we study two new type...
متن کاملZagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
متن کاملCapturing and Re-Using Artistic Styles with Reverse Subdivision-Based Multiresolution Methods
We describe a multiresolution method for rendering curves that is based on exact reproduction of artistic silhouettes and line hand-gesture styles. Using analysis based on reverse subdivision, we extract examples from both scanned images of line-drawn artwork and interactively-sketched input and apply these styles to the arbitrary strokes of new illustrations. Our algorithms work directly with ...
متن کاملAcyclic 3-Colorings and 4-Colorings of Planar Graph Subdivisions
An acyclic coloring of a graph G is an assignment of colors to the vertices of G such that no two adjacent vertices receive the same color and every cycle in G has vertices of at least three different colors. An acyclic k-coloring of G is an acyclic coloring of G with at most k colors. It is NP-complete to decide whether a planar graph G with maximum degree four admits an acyclic 3-coloring [1]...
متن کاملDrawing Phylogenetic Trees : (Extended Abstract)
We present linear-time algorithms for drawing phylogenetic trees in radial and circular representations. In radial drawings given edge lengths (representing evolutionary distances) are preserved, but labels (names of taxons represented in the leaves) need to be adjusted, whereas in circular drawings labels are perfectly spread out, but edge lengths adjusted. Our algorithms produce drawings that...
متن کامل